-
1 doubly connected graph
1) Техника: двухсвязный граф2) Макаров: двусвязный графУниверсальный англо-русский словарь > doubly connected graph
-
2 doubly connected graph
English-russian dictionary of physics > doubly connected graph
-
3 doubly connected graph
English-Russian scientific dictionary > doubly connected graph
-
4 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
5 connected
1) связанный
2) связный
– arcwise connected
– connected chain
– connected doublet
– connected graph
– connected with
– cyclically connected
– doubly connected
– finitely connected
– irreducibly connected
– multiply connected
– not simply connected
– simply connected
– strongly connected
– triply connected
affinely connected space — <geom.> пространство аффинной связности
simply connected superconductor — односвязный сверхпроводник
-
6 doubly
1) вдвое
2) двояко
3) двусвязный
4) двусторонно
5) дважды
6) вдвойне
7) сугубо
8) двойственно
– doubly concave
– doubly connected
– doubly convex
– doubly ionized
– doubly periodic
– doubly refracting
doubly integrating accelerometer — <tech.> акселерометр с двойным интегрированием ускорения
-
7 graph
1) график
2) строить график
3) диаграмма
4) одномерный комплекс
5) чертить диаграмму
6) граф
7) дерево
– alternating graph
– bar graph
– basin of graph
– bichromatic graph
– bunch graph
– complete graph
– connected graph
– construct graph
– construction of graph
– directed graph
– finite graph
– flat graph
– graph method
– graph paper
– graph theory
– infinite graph
– line graph
– logarithmic graph
– node of graph
– oriented graph
– parallax-correction graph
– schedule graph
– signal-flow graph
– signed graph
– singular graph
– specify graph
– state graph
– superposed graph
– tree graph
– two-dimensional graph
-
8 domain
1) владение, имение2) территория, зона3) физ. домен4) область, сфера5) матем. область определения6) область, домен• -
9 manifold
1) коллектор; магистраль2) гребёнка4) геом. многообразие5) патрубок6) анат. летошка7) рампа; батарея газовых баллонов8) многократный; многократно9) камера; распределитель10) многообразный; разнообразный; разнородный•manifold with boundary — многообразие с границей, многообразие с краем
- almost homogeneous manifold - almost orientable manifold - almost parallelizable manifold - almost smooth manifold - completely parallelizable manifold - finitely compact manifold - finitely triangulated manifold - globally harmonic manifold - holomorphically convex manifold - locally homogeneous complex manifold - locally plane manifold - locally symmetric manifold - locally trivial manifold - locally unknotted manifold - maximal integral manifold - orbitally asymptotically stable manifold - strongly harmonic manifold - unlimited covering manifold - weighted homogeneous manifoldmanifold without boundaries — многообразие без границ, многообразие с краем
См. также в других словарях:
Doubly connected edge list — The doubly connected edge list (DCEL) is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provides efficient manipulation of the topological information associated with the objects … Wikipedia
Doubly-connected edge list — The doubly connected edge list (DCEL) is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provide efficient manipulation of the topological information associated with the objects… … Wikipedia
Doubly-connected edge list — Die Doubly connected edge list (DCEL, doppelt verkettete Kantenliste) ist eine Datenstruktur, die einen zusammenhängenden planaren Graphen repräsentiert, der in die Ebene eingebettet ist. Die Datenstruktur wird in der algorithmischen Geometrie… … Deutsch Wikipedia
Graph embedding — In topological graph theory, an embedding of a graph G on a surface Sigma; is a representation of G on Sigma; in which points of Sigma; are associated to vertices and simple arcs (homeomorphic images of [0,1] ) are associated to edges in such a… … Wikipedia
Planar straight-line graph — (PSLG) is a term used in computational geometry for an embedding of a planar graph in the plane such that its edges are mapped into straight line segments. [cite book author = Franco P. Preparata and Michael Ian Shamos | title = Computational… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
List of mathematics articles (D) — NOTOC D D distribution D module D D Agostino s K squared test D Alembert Euler condition D Alembert operator D Alembert s formula D Alembert s paradox D Alembert s principle Dagger category Dagger compact category Dagger symmetric monoidal… … Wikipedia
Parity of zero — Zero objects, divided into two equal groups Zero is an even number. In other words, its parity the quality of an integer being even or odd is even. Zero fits the definition of even number : it is an integer multiple of 2, namely 0 × 2. As a… … Wikipedia
Evenness of zero — The number 0 is even. There are several ways to determine whether an integer is even or odd, all of which indicate that 0 is an even number: it is a multiple of 2, it is evenly divisible by 2, it is surrounded on both sides by odd integers, and… … Wikipedia
